Watershed Delineation Algorithm Using Kruskal's Algorithm and Triangulated Irregular Network
نویسندگان
چکیده
منابع مشابه
A watershed algorithm for triangulated terrains
We study the problem of automatically identifying watershed boundaries from digital elevation data. Nelson et al. have a vector-based algorithm to solve this problem, but their approach cannot guarantee that each watershed is a single polygon because of the modeling assumptions. We propose a vector-based algorithm that is provably consistent with its modeling assumptions and that guarantees one...
متن کاملA hierarchical network-based algorithm for multi-scale watershed delineation
Watershed delineation is a process for defining a land area that contributes surface water flow to a single outlet point. It is a commonly used in water resources analysis to define the domain in which hydrologic process calculations are applied. There has been a growing effort over the past decade to improve surface elevation measurements in the U.S., which has had a significant impact on the ...
متن کاملThe Triangulated Irregular Network
Our first motive for this research stems from problems with traditional terrain representations which were recognized as early as 1967 by Boehm. Topographic surfaces are non-stationary (Pike and R-ozema, 1975), i.e., the roughness of the terrain is not periodic but changes from one landtype to another. A regular grid therefore has to be adjusted to the roughest terrain in the mod'el and be high...
متن کاملAn Irregular Lattice Pore Network Model Construction Algorithm
Pore network modeling uses a network of pores connected by throats to model the void space of a porous medium and tries to predict its various characteristics during multiphase flow of various fluids. In most cases, a non-realistic regular lattice of pores is used to model the characteristics of a porous medium. Although some methodologies for extracting geologically realistic irregular net...
متن کاملA New Algorithm for Guarding Triangulated Irregular Networks
In this paper, we present a new algorithm for vertex guarding of a triangulated surface, which takes into account the heights of the vertices and considers the global visibility of the guards. In this algorithm, the initial surface is reduced to a collection of simple polygons and trivial triangulated surfaces. This is done by assigning guards to some vertices and removing the faces covered by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of The Korean Society of Agricultural Engineers
سال: 2006
ISSN: 1738-3692
DOI: 10.5389/ksae.2006.48.4.003